#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <vector>
#include <stack>
#include <queue>
#include <set>
using namespace std;
class Solution
{
public:
    // [5,-3,5][5,-3,5]
    // dp[i]表示从第A[A.len+i%A.len]到A[i]内的最大和
    int maxSubarraySumCircular(vector<int> &A)
    {
    }
};